The Clique - PDFSEARCH.IO - Document Search Engine

The Clique
Results: 193

#	Item
61	Forum on Public Policy The Use of British Nursery Rhymes and Contemporary Technology as Venues for Creating and Expressing Hidden Literacies Throughout Time by Children, Adolescents, And Adults Lisa A. Hazlett, Professo Add to Reading List Source URL: forumonpublicpolicy.com Language: English - Date: 2013-02-27 14:04:59 Nursery rhyme New literacies Youth Clique Adolescence
62	The Parameterized Complexity of Global Constraints∗ C. Bessiere LIRMM Montpellier, France Add to Reading List Source URL: homepages.laas.fr Language: English - Date: 2010-11-22 06:22:28 Computer programming Local consistency Constraint satisfaction Constraint logic programming Parameterized complexity Mathematical optimization Clique problem Decomposition method Complexity of constraint satisfaction Constraint programming Theoretical computer science Software engineering
63	URL: http://www.elsevier.nl/locate/entcs/volume61.html 19 pages Parameterized Complexity: The Main Ideas and Connections to Practical Computing Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:10:30 NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Dominating set Kernelization Vertex cover Clique problem NP-complete Theoretical computer science Computational complexity theory Applied mathematics
64	Originally published in Proc. 3rd WALCOM, LNCS. Springer, 2009. To appear. Parameterized Complexity of Stabbing Rectangles and Squares in the Plane Michael Dom1 and Michael R. Fellows2,⋆ and Frances A. Rosamond2,⋆ 1 Add to Reading List Source URL: theinf1.informatik.uni-jena.de Language: English - Date: 2008-12-19 10:15:00 Applied mathematics Computational complexity theory Quadrilaterals Rectangle Matrix Dominating set Vertex cover Parameterized complexity Clique Theoretical computer science NP-complete problems Mathematics
65	A Local-Search 2-Approximation for 2-Correlation-Clustering Tom Coleman, James Saunderson, and Anthony Wirth The University of Melbourne Abstract. CorrelationClustering is now an established problem in Add to Reading List Source URL: www.mit.edu Language: English - Date: 2012-07-29 14:44:15 NP-complete problems Matroid theory Spanning tree Signed graph Graph Clique Tree Combinatorial optimization Eulerian path Graph theory Theoretical computer science Mathematics
66	Evolutionary Reputation Games On Social Networks Chen Avin Communication Systems Engineering Department, Ben-Gurion University of The Negev, Add to Reading List Source URL: www.complex-systems.com Language: English - Date: 2012-09-20 14:37:04 Networks Reciprocity Clustering coefficient Clique Small-world network Social network Random graph Scale-free network Graph Graph theory Mathematics Network theory
67	Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 3, MayWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 06:03:09 NP-complete problems Bidimensionality Parameterized complexity Kernelization Branch-decomposition Path decomposition Tree decomposition Clique Feedback vertex set Graph theory Theoretical computer science Mathematics
68	Thesis for the degree ‫עבודת גמר (תזה) לתואר‬ Master of Science Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2015-01-22 08:25:27 NP-complete problems Graph coloring Graph operations Clique problem Clique Randomized algorithm Path decomposition Graph theory Theoretical computer science Mathematics
69	Logspace Versions of the Theorems of Bodlaender and Courcelle Michael Elberfeld Andreas Jakoby Add to Reading List Source URL: wwwmayr.informatik.tu-muenchen.de Language: English - Date: 2010-10-27 06:30:50 Graph operations Tree decomposition Tree Connectivity Dominating set Directed acyclic graph Graph Matching Clique Graph theory Mathematics Theoretical computer science
70	CS109B Notes for LectureNP-Complete Problems We have met some problems that have \easy" solutions; they have algorithms that run in time that is polynomial in the size of the graph, the parameter m. Examples: Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2008-09-19 00:58:50 NP-complete problems Graph coloring Independent set NP-complete Clique Vertex cover NP Clique cover problem Domatic number Theoretical computer science Graph theory Computational complexity theory

UPDATE